SYSTEM FOR VEHICLE ROUTING PROBLEM ALGORITHMS ANALYSIS
نویسندگان
چکیده
منابع مشابه
Approximation algorithms for a vehicle routing problem
In this paper we investigate a vehicle routing problem motivated by a realworld application in cooperation with the German Automobile Association (ADAC). The general task is to assign service requests to service units and to plan tours for the units such as to minimize the overall cost. The characteristics of this large-scale problem due to the data volume involve strict real-time requirements....
متن کاملThree New Heuristic Algorithms For The Fleet Size And Mix Green Vehicle Routing Problem
In recent years, great efforts have been made to reduce greenhouse gas emissions by vehicles. Petroleum products produces greenhouse gas emissions, therefore reducing the use of these products can make a major contribution to reducing pollution. The Fleet Size and Mix Vehicle Routing Problem is one of the most widely used routing branches. In this problem, there are vehicle with different capac...
متن کاملThe Vehicle Routing Problem: Algorithms and Applications
The Vehicle Routing Problem (VRP) is an hard and very well-known combinatorial optimization problem which finds many practical applications in the design and management of distribution systems. The VRP is concerned with the design of the optimal routes used by a fleet of identical vehicles stationed at a central depot to serve a set of customers with known demands. In the basic version of the p...
متن کاملVehicle Routing Problem Vehicle Routing Problem
ing and non-profit use of the material is permitted with credit to the source. Statements and opinions expressed in the chapters are these of the individual contributors and not necessarily those of the editors or publisher. No responsibility is accepted for the accuracy of information contained in the published articles. Publisher assumes no responsibility liability for any damage or injury to...
متن کاملA HYBRID ALGORITHM FOR THE OPEN VEHICLE ROUTING PROBLEM
The open vehicle routing problem (OVRP) is a variance of the vehicle routing problem (VRP) that has a unique character which is its open path form. This means that the vehicles are not required to return to the depot after completing service. Because this problem belongs to the NP-hard problems, many metaheuristic approaches like the ant colony optimization (ACO) have been used to solve OVRP in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Informatics Control Measurement in Economy and Environment Protection
سال: 2017
ISSN: 2083-0157,2391-6761
DOI: 10.5604/01.3001.0010.4833